Geometric containers for efficient shortest-path computation
نویسندگان
چکیده
منابع مشابه
Geometric Shortest Path Containers
In this paper, we consider Dijkstra’s algorithm for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for on-line queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can be only linear in the number of nodes. We assume that a layout of the graph is given. In the preprocessing...
متن کاملShortest Path Geometric
Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signiicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accura...
متن کاملConstrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points....
متن کاملI/O-Efficient Shortest Path Queries in Geometric Spanners
We present I/O-efficient algorithms to construct planar Steiner spanners for point sets and sets of polygonal obstacles in the plane, and for constructing the “dumbbell” spanner of [6] for point sets in higher dimensions. As important ingredients to our algorithms, we present I/O-efficient algorithms to color the vertices of a graph of bounded degree, answer binary search queries on topology bu...
متن کاملExploiting Road Network Properties in Efficient Shortest‐path Computation
The essential elements of any navigation system are a shortest‐path algorithm and a map dataset. When seen in the light of the basic requirement of such a system, to provide high quality navigation solutions fast, algorithms have to be efficient and road networks have to be up‐to‐date. The contribution of this work is two‐fold. First, the HBA* algorithm, an efficient shortest‐path algorithm, is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2005
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1064546.1103378